MINLP formulations for continuous piecewise linear function fitting
نویسندگان
چکیده
Abstract We consider a nonconvex mixed-integer nonlinear programming (MINLP) model proposed by Goldberg et al. (Comput Optim Appl 58:523–541, 2014. 10.1007/s10589-014-9647-y ) for piecewise linear function fitting. show that this MINLP is incomplete and can result in curve not the graph of function, because it misses set necessary constraints. provide two counterexamples to illustrate effect, propose three alternative models correct behavior. investigate theoretical relationship between these evaluate their computational performance.
منابع مشابه
Fitting piecewise linear continuous functions
We consider the problem of fitting a continuous piecewise linear function to a finite set of data points, modeled as a mathematical program with convex objective. We review some fitting problems that can be modeled as convex programs, and then introduce mixed-binary generalizations that allow variability in the regions defining the best-fit function’s domain. We also study the additional constr...
متن کاملConvex piecewise-linear fitting
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on d...
متن کاملContinuous Piecewise Linear Approximation of BV Function
Nonlinear approximation is widely used in signal processing. Real-life signals can be modeled as functions of bounded variation. Thus the variable knot of approximating function could be selfadaptively chosen by balancing the total variation of the target function. In this paper, we adopt continuous piecewise linear approximation instead of the existing piecewise constants approximation. The re...
متن کاملA Decomposition-based MINLP Solution Method Using Piecewise Linear Relaxations
A rigorous decomposition-based approach for solution of nonseparable mixedinteger nonlinear programs involving factorable nonconvex functions is presented. The proposed algorithm consists of solving an alternating sequence of Relaxed Master Problems (a Mixed-Integer Linear Program) and nonlinear programming problems. The number of major iterations can be significantly decreased by use of piecew...
متن کاملFitting Piecewise Linear Copulas to Data
Given a set of n data points (xi, yi, zi) ∈ [0, 1] , two methods are established for constructing two piecewise linear copulas, respectively denoted CA(x, y) and CB(x, y), in such a way that CA(xi, yi) and CB(xi, yi) both yield an approximation of zi for all i. If the data points are (randomly) sampled from an unknown copula C, i.e. zi = C(xi, yi), then CA and CB provide two piecewise linear es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2021
ISSN: ['0926-6003', '1573-2894']
DOI: https://doi.org/10.1007/s10589-021-00268-5